Approximate Pareto sets of minimal size for multi-objective optimization problems
نویسندگان
چکیده
منابع مشابه
Approximate Pareto sets of minimal size for multi-objective optimization problems
We are interested in a problem introduced by Vassilvitskii and Yannakakis [12], the computation of a minimum set of solutions that approximates within an accuracy ε the Pareto set of a multi-objective optimization problem. We mainly establish a new 3-approximation algorithm for the bi-objective case. We also propose a study of the greedy algorithm performance for the triobjective case when the ...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملapproximate pareto optimal solutions of multi-objective optimal control problems by evolutionary algorithms
in this paper an approach based on evolutionary algorithms to find pareto optimal pair of state and control for multi-objective optimal control problems (moocp)'s is introduced. in this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملSmall Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy 2 the Pareto curve of a multiobjective optimization problem. We show that for a broad class of bi-objective problems (containing many important widely studied problems such as shortest paths, spanning tree, matching and many others), we can compute in polynomial time an 2-Pareto set ...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2015
ISSN: 0167-6377
DOI: 10.1016/j.orl.2014.10.003